permutation automata造句

例句与造句

1. Meyer and Thompson ( 1969 ) give a version of Krohn Rhodes decomposition for finite automata that is equivalent to the decomposition previously developed by Hartmanis and Stearns, but for useful decompositions, the notion of " expanding " the state-set of the original automaton is essential ( for the non-permutation automata case ).
2. It's difficult to find permutation automata in a sentence. 用permutation automata造句挺难的